An efficient estimator for Gibbs random fields
نویسنده
چکیده
An efficient estimator for the expectation R f dP is constructed, where P is a Gibbs random field, and f is a local statistic, i. e. a functional depending on a finite number of coordinates. The estimator coincides with the empirical estimator under the conditions stated in Greenwood and Wefelmeyer [6], and covers the known special cases, namely the von Mises statistic for the i.i.d. underlying fields and the case of one-dimensional Markov chains.
منابع مشابه
Bayesian Model Choice using Coupled ABC
In Neal (2010), a novel Approximate Bayesian Computation (ABC) algorithm, coupled ABC, was introduced. This paper shows how coupled ABC can be used in an efficient manner for model choice in a Bayesian framework. The methodology is applied to Gibbs random fields and stochastic epidemic models. Furthermore a very efficient simulation procedure for Gibbs random fields with a given sufficient summ...
متن کاملHorvitz-Thompson estimator of population mean under inverse sampling designs
Inverse sampling design is generally considered to be appropriate technique when the population is divided into two subpopulations, one of which contains only few units. In this paper, we derive the Horvitz-Thompson estimator for the population mean under inverse sampling designs, where subpopulation sizes are known. We then introduce an alternative unbiased estimator, corresponding to post-st...
متن کاملLearning in Gibbsian Fields: How Accurate and How Fast Can It Be?
ÐGibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronounced by the recent minimax entropy (FRAME) models which use large neighborhoods and hundreds of parameters [22]. In this paper, we present a common framework for learning Gibbs models. We identify two key factors that ...
متن کاملGaussian sampling by local perturbations
We present a technique for exact simulation of Gaussian Markov random fields (GMRFs), which can be interpreted as locally injecting noise to each Gaussian factor independently, followed by computing the mean/mode of the perturbed GMRF. Coupled with standard iterative techniques for the solution of symmetric positive definite systems, this yields a very efficient sampling algorithm with essentia...
متن کاملEfficient Simulation for Tail Probabilities of Gaussian Random Field Extrema
We are interested in computing tail probabilities for the maxima of smooth Gaussian random fields. In this paper, we discuss two special cases: random fields defined over a finite number of distinct point and fields with finite KarhunenLoève expansions. For the the first case we propose an importance sampling estimator which yields asymptotically zero relative error. Moreover, it yields a proce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Kybernetika
دوره 50 شماره
صفحات -
تاریخ انتشار 2014